On the $r$-th Root Partition Function
نویسندگان
چکیده
منابع مشابه
Irreducibility and Deterministic r-th Root Finding over Finite Fields
Constructing r -th nonresidue over a nite eld is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r e (where r is a prime) over a given nite eld Fq of characteristic p (equivalently, constructing the bigger eld Fqr e ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some ne...
متن کاملTrace Expression of r-th Root over Finite Field
Efficient computation of r-th root in Fq has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller’s result on square root, and which provides a possible improvement of the CipollaLehmer type algorithms for general case. More precisely, for given r-th power c ∈ Fq, we show that there exists α ∈ Fqr such that Tr...
متن کاملIrreducibility and r-th root finding over finite fields
Constructing r-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree re (where r is a prime) over a given finite field Fq of characteristic p (equivalently, constructing the bigger field Fqr ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some n...
متن کاملOn Tracking The Partition Function
Markov Random Fields (MRFs) have proven very powerful both as density estimators and feature extractors for classification. However, their use is often limited by an inability to estimate the partition function Z. In this paper, we exploit the gradient descent training procedure of restricted Boltzmann machines (a type of MRF) to track the log partition function during learning. Our method reli...
متن کاملOn Stanley's Partition Function
Stanley defined a partition function t(n) as the number of partitions λ of n such that the number of odd parts of λ is congruent to the number of odd parts of the conjugate partition λ modulo 4. We show that t(n) equals the number of partitions of n with an even number of hooks of even length. We derive a closed-form formula for the generating function for the numbers p(n)− t(n). As a consequen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2016
ISSN: 1027-5487
DOI: 10.11650/tjm.20.2016.6812